Universal Lattice Codes for MIMO Channels
نویسندگان
چکیده
We propose a coding scheme that achieves the capacity of the compound MIMO channel with algebraic lattices. Our lattice construction exploits the multiplicative structure of number fields and their group of units to absorb ill-conditioned channel realizations. To shape the constellation, a discrete Gaussian distribution over the lattice points is applied. These techniques, along with algebraic properties of the proposed lattices, are then used to construct a sub-optimal de-coupled coding schemes that achieves a gap to compound capacity by decoding in a lattice that does not depend of the channel realization. The gap is characterized in terms of algebraic invariants of the codes, and shown to be significantly smaller than previous schemes in the literature. We also exhibit alternative algebraic constructions that achieve the capacity of ergodic fading channels.
منابع مشابه
Almost universal codes for MIMO wiretap channels
Despite several works on secrecy coding for fading and MIMO wiretap channels from an error probability perspective, the construction of information theoretically secure codes over such channels remains as an open problem. In this paper, we consider a fading wiretap channel model where the transmitter has only partial statistical channel state information. We extend the flatness factor criterion...
متن کاملD-BLAST Lattice Codes for MIMO Block Rayleigh Fading Channels
We propose a class of layered space-time block codes (STBCs) for the quasi-static multi-input multi-output (MIMO) Rayleigh fading channel. The proposed codes use singleinput single-output (SISO) component codes based on algebraic number theory in the so called diagonal BLAST (D-BLAST) architecture. Based on a pairwise error probability analysis, we show that the diversity order of the frame err...
متن کاملApproximately-Universal Space-Time Codes for the Parallel, Multi-Block and Cooperative-Dynamic-Decode-and-Forward Channels
Explicit codes are constructed that achieve the diversity-multiplexing gain tradeoff of the cooperative-relay channel under the dynamic decode-andforward protocol for any network size and for all numbers of transmit and receive antennas at the relays. A particularly simple code construction that makes use of the Alamouti code as a basic building block is provided for the single relay case. Alon...
متن کاملLattice Coding and Decoding Achieve the Optimal Diversity-vs-Multiplexing Tradeoff of MIMO Channels
This paper considers communication over coherent multiple-input multiple-output (MIMO) flat fading channels where the channel is only known at the receiver. For this setting, we introduce the class of LAttice Space-Time (LAST) codes. We show that these codes achieve the optimal diversity-vs-multiplexing tradeoff defined by Zheng and Tse under generalized minimum Euclidean distance lattice decod...
متن کاملOn the Role of MMSE in Lattice Decoding: Achieving the Optimal Diversity-vs-Multiplexing Tradeoff
In this paper, we introduce the class of lattice space-time codes as a generalization of linear dispersion (LD) coding. We characterize the diversity-vs-multiplexing tradeoff achieved by random lattice coding with lattice decoding. This characterization establishes the optimality of lattice vertical codes when coupled with lattice decoding. We then generalize Erez and Zamir mod-Λ construction t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016